Elliptic Gabriel graph for finding neighbors in a point set and its application to normal vector estimation

نویسندگان

  • Joon C. Park
  • Hayong Shin
  • Byoung Kyu Choi
چکیده

Point-based shape representation has received increased attention in recent years, mainly due to its simplicity. One of the most fundamental operations for point set processing is to find the neighbors of each point. Mesh structures and neighborhood graphs are commonly used for this purpose. However, though meshes are very popular in the field of computer graphics, neighbor relations encoded in a mesh are often distorted. Likewise, neighborhood graphs, such as the minimum spanning tree (MST), relative neighborhood graph (RNG), and Gabriel graph (GG), are also imperfect as they usually give too few neighbors for a given point. In this paper, we introduce a generalization of Gabriel graph, named elliptic Gabriel graph (EGG), which takes an elliptic influence region instead of the circular region in GG. In order to determine the appropriate aspect ratio of the elliptic influence region of EGG, this paper also presents the analysis between the aspect ratio of the elliptic influence region and the average valence of the resulting neighborhood. Analytic and empirical test results are included. q 2006 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elliptic Gabriel Graph for Finding Neighbors in a Point Set

Point-based shape representation has received increased attention in recent years, mainly due to its simplicity. One of the most fundamental operations for point set processing is to find the neighbors of each point. To do this, mesh structures and neighborhood graphs are commonly used. However, though meshes are very popular in the field of computer graphics, neighbor relations encoded in a me...

متن کامل

Some local fixed point results under $C$-class functions with applications to coupled elliptic systems

The main objective of the paper is to state newly fixed point theorems for set-valued mappings in the framework of 0-complete partial metric spaces which speak about a location of a fixed point with respect to an initial value of the set-valued mapping by using some $C$-class functions. The results proved herein generalize, modify and unify some recent results of the existing literature. As an ...

متن کامل

The Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems

In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...

متن کامل

Proximity-Graph Instance-Based Learning, Support Vector Machines, and High Dimensionality: An Empirical Comparison

Previous experiments with low dimensional data sets have shown that Gabriel graph methods for instance-based learning are among the best machine learning algorithms for pattern classification applications. However, as the dimensionality of the data grows large, all data points in the training set tend to become Gabriel neighbors of each other, bringing the efficacy of this method into question....

متن کامل

A Survey on Complexity of Integrity Parameter

Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer-Aided Design

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2006